- Title
- The super-connectivity of the Kneser graph KG(n, 3)
- Creator
- Chen, Yulan; Lin, Yuqing; Yan, Weigen
- Relation
- Australasian Journal of Combinatorics Vol. 82, Issue 2, p. 201-211
- Publisher Link
- http://dx.doi.org/10.48550/arXiv.2103.10041
- Publisher
- Centre for Discrete Mathematics & Computing
- Resource Type
- journal article
- Date
- 2022
- Description
- A vertex cut S of a connected graph G is a subset of vertices of G whose deletion makes G disconnected. A super vertex cut S of a connected graph G is a subset of vertices of G whose deletion makes G disconnected and there is no isolated vertex in each component of G − S. The super-connectivity of graph G is the size of the minimum super vertex cut of G. Let KG(n, k) be the Kneser graph whose vertices are the k-subsets of {1, …, n}, where k is the number of labels of each vertex in G. We have shown in this paper that the conjecture from [G.B. Ekinci and J.B. Gauci, Discuss. Math. Graph Theory 39 (2019), 5–11] on the super-connectivity of the Kneser graph KG(n, k) is true when k = 3.
- Subject
- super-connectivity; Kneser graph; super connected; super vertex cut
- Identifier
- http://hdl.handle.net/1959.13/1469290
- Identifier
- uon:48190
- Identifier
- ISSN:1034-4942
- Language
- eng
- Reviewed
- Hits: 810
- Visitors: 803
- Downloads: 0